#include <bits/stdc++.h>
using namespace std;

class Solution
{
public:
    int minMoves(vector<string> &classroom, int energy)
    {
        int dx[4] = {0,0,1,-1};
        int dy[4] = {1, -1, 0, 0};
        int n = classroom.size(), m = classroom.at(0).size();
        vector<vector<bool>> vis(n, vector<bool>(m, false));
        vector<vector<int>> grid(n, vector<int>(m));
        queue<pair<int, int>> q;
        q.push({0, 0});
        int num = energy;
        while (!q.empty())
        {
            auto now = q.front();
            q.pop();
            int x = now.first, y = now.second;
            for (int i = 0; i < 4; i++)
            {
                int nx = dx[i]+x, ny = dy[i] + y;
                if(nx<0||nx>=n||ny<0||ny>n||vis[nx][ny])
                    continue;
            }
        }
    }
};